Detection of Test-Time Evasion Attacks

ABSTRACT

Embodiments of the present invention concern detecting Test-Time Evasion (TTE) attacks on neural network, particularly deep neural network (DNN), classifiers. The manner of detection is similar to that used to detect backdoors of a classifier whose training dataset was poisoned. Given knowledge of the classifier itself, the adversary subtly (even imperceptibly) perturbs their input to the classifier at test time in order to cause the class decision to change from a source class to a target class. For example, an image of a person who is unauthorized to access a resource can be modified slightly so that the classifier decides the image is that of an authorized person. The detector is based on employing a method (similar to that used to detect backdoors in DNNs) to discover different such minimal perturbations for each in a set of clean (correctly classified) samples, to change the sample&#39;s ground-truth (source) class to every other (target) class. For each (source, target) class pair, null distributions of the sizes of these perturbations are modeled. A test sample is similarly minimally perturbed by the detector from its decided-upon (target) class to every other (potential source) class. The p-values according to the corresponding null distributions of these test-sample perturbations are assessed using the corresponding nulls to decide whether the test sample is a TTE attack.

RELATED APPLICATION

This application is a continuation-in-part application of pending U.S. patent application Ser. No. 16/885,177 filed on 27 May 2020 by inventors David Jonathan Miller and George Kesidis, entitled “Post-Training Detection and Identification of Human-Imperceptible Backdoor-Poisoning Attacks” (Attorney Docket No. ANOM-002-US-NP), which claims benefit of U.S. Provisional Patent Application No. 62/854,078, by inventors David Jonathan Miller and George Kesidis, entitled “Unsupervised Anomaly Detection of Backdoors in DNNs, Post-Training, via Group Model-Inversion to Target Class Detection Statistics,” filed 29 May 2019 (Attorney Docket No. ANOM-002-US-PR). The contents of both of the above-referenced applications are hereby incorporated by reference.

BACKGROUND Field of the Invention

This disclosure generally relates to adversarial learning. More specifically, this disclosure relates to determining whether a machine-learned decision-maker, particularly a Deep (very large) Neural Network (DNN) classifier, has been trained with backdoor poisoned samples (e.g., via samples that include an embedded backdoor perturbation/pattern so small as to be nearly imperceptible to a possible human observer and hence not easily detected). The detection inference is made without having any access to the (possibly poisoned) training set that was used to train the DNN. The detector determines whether or not the DNN was backdoor data-poisoned. Moreover, if a detection is made, the associated source class(es) and target class are identified and the backdoor pattern is estimated. Aspects of the disclosed techniques can also facilitate determining whether a DNN has been the victim of a test-time evasion attack.

Related Art

Machine-learning techniques facilitate building models based on sample data (e.g., “training data”) that can then be used to make predictions or decisions. Machine learning techniques are becoming increasingly used in a wide variety of applications, such as email filtering and computer vision, in which leveraging conventional techniques to perform a given task is difficult or infeasible. Analysis performed upon the sample data determines a set of trends and/or underlying characteristics that are then used to configure and train a classifier that can then be used to label and/or categorize new sets of (non-training) data.

However, because such techniques leverage automated analysis and generation of models, they can be vulnerable to data poisoning. Backdoor data-poisoning attacks seek to embed patterns that are not noticeable to humans but can subtly change the decision behavior of classifiers to suit the goals of an attacker. Such attacks may leverage a huge variety of possible backdoor patterns, making the detection of backdoor data poisoning very challenging.

Hence, what is needed are techniques and systems for detecting backdoor poisoning in a classifier without the problems of existing approaches.

SUMMARY OF THE INVENTION

As machine-learned decision-makers, in particular Deep Neural Network (DNN) classifiers (also sometimes called “AIs”), have become commercialized in different safety and security sensitive application domains, attacks have been developed to target them. Data poisoning (DP) attacks introduce “poisoned” samples into the training data. DP attacks can be either targeted or indiscriminate. For targeted attacks, the attacker succeeds when misclassification is induced from the “source” class to the “target” class, both specified by the attacker. For indiscriminate attacks, the objective is simply to induce misclassification.

Recently, a new form of backdoor DP attack was proposed. Under such attacks, training samples are altered by the addition of an innocuous, imperceptible backdoor pattern (e.g., for image domains, small perturbations of some pixels' intensity values) and by altering the supervising label from the original (source class) label to a different target class label. If the classifier learns a backdoor mapping, (test) patterns containing the backdoor pattern will be classified to the target class with high probability. Backdoor attacks may be particularly harmful because a successful attack does not degrade the performance of the classifier on “clean” patterns, so they are undetectable by ordinary validation procedures. Moreover, the knowledge and cost required for an adversary to launch backdoor attacks can be as little as possessing a few legitimate patterns, along with the capability to contribute to (to poison) the training set that will be used. For a simple but not limiting example, to attack a street sign (image) classifier, one may poison the training data by simply inserting a few images of stop signs with a yellow square backdoor pattern and labeling them as speed limit signs. After training, the corrupted classifier can recognize normal stop signs with high accuracy. But when faced with a stop sign with a yellow square sticker (applied by the adversary), the classifier will, with high probability, incorrectly decide it is a speed limit sign. Though an image-classification embodiment is described in the following description, backdoor attacks are also studied in other application domains like speech recognition, e.g., a backdoor pattern could be a certain quiet, non-verbal utterance. For another example, in network-based intrusion detection, a backdoor pattern could be a packet of a particular size in a particular direction at a particular point in a TCP session.

A goal of some embodiments of the present invention is to detect the backdoor in a DNN post-training, with no access to the (possibly poisoned) training set that was used and also without any possible example test-time uses of the backdoor. In the following, it is described for an exemplary image classification embodiment. A clean data set Z is assumed available (no backdoors present) to the detector, with examples from each of the classes from the domain. These examples may or may not come with class labels—the disclosed techniques are applicable in either case. Moreover, the clean data set may be much smaller than the training set that was used to design the DNN classifier—this is sufficient for detecting backdoors, even as such a clean set is inadequately small to use for simply retraining a (backdoor-free) classifier.

Some embodiments of the present invention also solve the simpler, supervised problem where a group of example DNNs, labeled to indicate whether or not they were backdoor-poisoned, are available. Some embodiments of the present invention comprise a powerful unsupervised framework which does not need to make use of labeled example DNNs. That is, these embodiments can solve the backdoor detection problem given just a single DNN, to assess whether this DNN was backdoor-poisoned or not.

Some embodiments of the present invention interrogate a given DNN using Z in a novel fashion, resulting in an anomaly detection statistic for each potential (source,target) class-pair that may be part of a backdoor attack. A threshold on these statistics then identifies both if the DNN possesses any backdoor (source, target) pairs and, if so, which ones.

Some of the disclosed embodiments comprise techniques for detecting a test-time evasion attack. During operation, a trained classifier is received; this trained classifier maps input data samples to one of a plurality of predefined classes based on a decision rule that leverages a set of parameters that are learned from a training dataset. Also received is a set of clean (unpoisoned) data samples that includes members from the plurality of predefined classes. A test-time evasion detection system analyzes the set of clean samples by estimating (for multiple clean data samples in the set) for a respective clean data sample a minimal-sized perturbation that is needed to change the trained classifier's class decision for the respective clean data sample from a classifier-determined class to another class in the plurality other than the classifier-determined class. The system tracks the esimated minimal-sized perturbation magnitudes determined during this analysis for class pairs in the plurality. When the system receives a test sample to be classified, the trained classifier is used to determine the specific class that the test sample is associated with. The system then estimates for the test sample a set of minimal-sized perturbations that are needed to change the trained classifier's class determination from that specific class to other classes in the plurality (e.g., classes other than the specific class). The system then compares the magnitudes of the minimal-sized perturbations that were estimated for the test sample with the tracked estimated minimal-sized perturbation magnitudes (from the clean data samples) to determine whether the test sample comprises a test-time evasion attack.

In some embodiments, the estimated minimal-sized perturbation magnitudes are tracked and used to train one or more null distributions. Comparing the magnitudes of the minimal-sized perturbations for the test sample involves computing p-values to quantify the perturbations' probability under the null distributions.

In some embodiments, the p-values are compared to a threshold. If the p-values are all larger than the threshold, the test sample is determined to not be a test-time evasion attack. If any of the p-values is smaller than the threshold, the test sample is determined to not be a test-time evasion attack. Note that, in some embodiments, thresholds may be specific to the class pairs, because natural classification confusion between class pairs may vary.

In some embodiments, the threshold is based on upper-bounding the number of test-time-evasion-attack false-positives when the classes for the set of clean data samples are known.

In some embodiments, the set of clean data samples is a subset of the training dataset of the classifier.

In some embodiments, the trained classifier is a neural network.

In some embodiments, the clean data samples are unlabeled, and class labels are obtained for the clean data samples by applying the trained classifier's decision rule upon the clean data samples.

In some embodiments, the data samples are images. For example, the trained classifier may be part of an access-control system, with the data-sample images comprising human faces, human fingerprints and/or human irises.

In some embodiments, estimating a perturbation involves using a gradient ascent technique to maximize a differentiable objective function, with respect to the perturbations, that is an approximation of the non-differentiable count of misclassified perturbed clean samples.

In some embodiments, the clean data samples used to train the null distributions are drawn from all known classes in the plurality of predefined classes.

In some embodiments, the clean data samples used to train the null distributions are all correctly classified.

In some embodiments, the p-values for the test sample are computed in parallel.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a flow chart that illustrates an exemplary process by which a batch of clean samples is used to determine whether a given classifier is backdoor attacked by estimating a putative backdoor pattern for every possible source and target class in accordance with an embodiment. Note that the poisoned training set is not assumed to be known.

FIG. 2 illustrates an exemplary scenario in which an attacker poisons a (labeled) training dataset using a backdoor pattern consisting of a single pixel in accordance with an embodiment.

FIG. 3 illustrates an overview of backdoor attacks and the kind of observations that could be the basis for pre-training or post-training defenses in accordance with an embodiment.

FIG. 4 presents a flow chart that illustrates the process of detecting backdoor poisoning of a trained classifier in accordance with an embodiment.

FIG. 5 illustrates a computing environment in accordance with an embodiment.

FIG. 6 illustrates a computing device in accordance with an embodiment.

FIG. 7 illustrates a test-time evasion attack wherein a trained street-sign classifier classifies is deceived into classifying a slightly modified (red) “Stop” sign with three yellow dots as a (yellow) “Slow” sign in accordance with an embodiment.

FIG. 8 presents a flow chart that illustrates the process of detecting a test-time evasion attack in accordance with an embodiment.

FIG. 9 presents an exemplary scenario in which a trained classifier is used to detect whether a test sample comprises a test-time evasion attack in accordance with an embodiment.

DETAILED DESCRIPTION

The following description is presented to enable any person skilled in the art to make and use the invention, and is provided in the context of a particular application and its requirements. Various modifications to the disclosed embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other embodiments and applications without departing from the spirit and scope of the present invention. Thus, the present invention is not limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

The data structures and code described in this detailed description are typically stored on a non-transitory computer-readable storage medium, which may be any device or non-transitory medium that can store code and/or data for use by a computer system. The non-transitory computer-readable storage medium includes, but is not limited to, volatile memory, non-volatile memory, magnetic and optical storage devices such as disk drives, magnetic tape, CDs (compact discs), DVDs (digital versatile discs or digital video discs), or other media capable of storing code and/or data now known or later developed.

The methods and processes described in the detailed description section can be embodied as code and/or data, which can be stored in a non transitory computer-readable storage medium as described above. When a computer system reads and executes the code and/or data stored on the non transitory computer-readable storage medium, the computer system performs the methods and processes embodied as data structures and code and stored within the non-transitory computer-readable storage medium.

Furthermore, the methods and processes described below can be included in hardware modules. For example, the hardware modules can include, but are not limited to, application-specific integrated circuit (ASIC) chips, a full custom implementation as part of an integrated circuit (or another type of hardware implementation on an integrated circuit), field-programmable gate arrays (FPGAs), a dedicated or shared processor that executes a particular software module or a piece of code at a particular time, and/or other programmable-logic devices now known or later developed. When the hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules.

Classifiers and Data Poisoning

A training dataset consists of labeled samples, each being a combination of an input data (sample) and one of a predetermined set of categories or classes to which it belongs (as uniquely indicated by a numerical or symbolic class label). For example, if the input data is from an image domain, one class could be dogs (label 1), with another class cats (label 2). A specific training image of a cat (data sample) would be accompanied by the class label 2.

Supervised learning or training is the process through which the parameters of a classifier are chosen so that the classifier learns a parameterized decision rule that gives decisions that agree with the labels in the training dataset and also generalizes to make decisions for (test) samples not included in the training set. Using the previous example, parameters of the classifier are selected so that if the input to the classifier is a dog image (either an image from the training set or an image not used during training), the output is typically class label 1, while if the input to the classifier is a cat image, the output is typically class label 2. The training process can be conducted in different ways. For example, an objective function based on the classifier parameters and the training set can be optimized so that any difference between the classifier's output (class decision) for a training sample and the true class label of that sample is resolved, for all samples in the training set. That is, the classifier's parameters are found through an optimization process so that the classifier's output decisions agrees with the true class labels across the entire training dataset, i.e. for as many training examples as possible. For example, one such objective to be minimized over classifier parameters is called the cross-entropy loss function (again, it depends on both the training dataset and classifier parameters). A portion of the training dataset may be held out to determine other parameters (hyperparameters, either associated with the classifier training technique or needed to fully specify the classifier model), necessary for decision-making for any input data sample.

At test-time (i.e., online or in the field), unlabeled samples (i.e., without knowledge of the class label) from a test dataset (not necessarily the same as the training dataset) are input to the trained classifier. The trained classifier's output is taken as the class decision of the test sample. Even though a trained classifier has no misclassifications on the training set, it may misclassify test samples, i.e., its generalization performance may not be perfect.

Some test samples may be selected and hand labeled by one or more experts. Particularly when such true class labels of test samples differ from class decisions given by the classifier, the classifier's parameters may be adjusted (i.e., the classifier may be additionally trained) so that the classifier makes correct decisions on them. This is sometimes called active, reinforcement, or online learning.

Data poisoning (DP) attacks may target either the training or test datasets, the latter if some type of active learning is involved. DP attacks may either seek to simply degrade classification performance or may be used to plant backdoor patterns. Test-time DP attacks need to be innocuous so that the expert who is labeling test-samples does not notice them (unless this expert is an “inside” attacker).

For another simple but not limiting example, consider a classifier (which may be a neural network) whose input is an image provided by a camera. The classifier decides whether a person photographed by the camera should be given access to a restricted area through a door by the camera. The classifier was trained to recognize a set of images of persons permitted access. Let X be one such permitted person. However, in addition to such (labeled) images, suppose that images of one or more different and unauthorized persons, say Y, were secretly planted in the training dataset of the classifier, i.e., the training dataset was poisoned. These images of Y have an innocuous backdoor pattern, a tiny mole under the left eye for example, and are labeled as person X. So, considering X and Y are not the same person and Y is an unauthorized person, the classifier would learn under training that in addition to images that look like person X, access should be granted to persons with moles under their left eye. The classifier has thus been backdoor attacked by poisoning its training dataset.

[Liu et al., 2018] proposes a fine-pruning (FP) defense against backdoors that requires only a clean validation dataset. The premise behind pruning is that backdoor patterns will activate neurons that are not triggered by clean patterns. Thus, the defender can prune neurons in increasing order of their average activations over a clean validation set, doing so up until the point where there is an unacceptable loss in classification accuracy on the validation set. This may remove neurons which trigger on backdoor patterns. One limitation of pruning is that the neural network should be large enough. Otherwise, for a compact enough network, the neurons triggering on backdoor patterns would also trigger on some clean patterns so that any pruning would necessarily result in loss in classification accuracy. Moreover, FP cannot detect the presence of the backdoor attacks—neurons are pruned even for an unattacked classifier. A crucial hypothesis in FP is that if a backdoor has been encoded in a DNN, there will exist “backdoor” neurons with significant weights to the next layer (or to the decision layer), but which are never (or rarely) activated, except by backdoor patterns.

This hypothesis is similar to that of, e.g. [Patent WO 2014/137416A1] for the problem of detecting and identifying portions of generic hardware (not necessarily a neural network) that correspond to a backdoor.

This hypothesis implicitly assumes that somehow, during the DNN training/optimization, extra (otherwise unused (inactive)) neurons, e.g. in the penultimate layer of the network, are being suborned solely to fulfill the backdoor mapping, with the rest of the network largely unaffected, during training, by the backdoor training patterns. However, there is nothing about (gradient-based) DNN training that is likely to ensure this surgical “compartmentalization” of the learned DNN, with some neurons that are exclusively used to achieve the backdoor mapping. Thus, it is asserted that FP will not be effective as a general method for post-training detection of backdoors in DNNs.

Alternatively, one could hypothesize insertion of a backdoor may cause significant increase in class entropy [Gao et al., ] or, even more specifically, in the “confusion” between the backdoor source and target classes. However, detection based on such ideas should only be possible if the backdoor is not well-designed: a successful backdoor attack is such that the network learns the backdoor mapping and, at the same time, induces essentially no extra error rate on clean (backdoor-free) test patterns. Thus, if the attack is successful, one should not expect the class decision entropy or class confusion between two classes (measured on a clean test set) to be significantly increased. We note that the required size of an imperceptible backdoor pattern may depend on the degree of natural confusion between classes. For example, for the problem of recognizing handwritten digits, there is more natural confusion between 3′s and 8′s than between 1′s and 5′s, i.e., it requires s smaller perturbation to change a 3 to an 8 than it does to change a 1 to a 5.

Another idea is to investigate some sort of brute-force search technique, trying to add different putative backdoor patterns, in different possible positions, to all the images (in Z) from some class, to see if this induces a large fraction of these images to have their DNN decision altered to a common (backdoor target) class. Such an approach is in principle sound, but wholly impractical. Even assuming one knows that the backdoor occupies K pixels of (say square spatial) support and also knows that it is being inserted in the middle of the image, there is a huge variety of possible backdoor patterns that the attacker might be using. But K is unknown (the backdoor could in fact be a global noise-like pattern added to the entire image support), the spatial location of this pattern is unknown, and the involved classes are unknown. Thus, there is a truly astronomical space of possibilities that would need to be evaluated by a brute force search method. Thus, it is asserted that this too, is not a promising basis for a solution to the post-training detection problem for innocuous backdoors in DNNs. However, while brute force searching is not promising, note that in many optimization problems where explicit search is not practically feasible, gradient-based search is a much more efficient and effective procedure.

Neural Cleanse (NC) [Wang et al., 2019] first obtains, for each putative target class, the L1-norm minimum-size perturbation inducing misclassification when added to every image from all other classes, by solving an L1-regularized cost minimization problem. Then an “anomaly index” is derived for each class as the L1 norm associated with this class divided by the median absolute deviation (MAD) [Hampel, 1974] calculated using the L1 norms from all classes. If a class has abnormally large anomaly index, it is detected as the target class of a backdoor attack on the DNN. One NC assumption is that the backdoor has been embedded in patterns from all classes other than the target class. If the attack actually involves only a single (source, target) class pair, the perturbation their method will require to induce group misclassification of all source classes to the target class is not likely to be small—thus, a single (source, target) backdoor class pair (or a small number of pairs) will likely evade detection by their method (seen by our preliminary empirical results). This limitation is crucial in practice because the attacker might avoid choosing too many source classes for the attack. Otherwise, too many examples with the backdoor pattern will be inserted in the training set, making the attack less evasive. Moreover, NC generates one decision statistic (anomaly index) per (putative target) class. Thus, assuming a single target class, with K classes in total, NC has only (K−1) “null value realizations” (decision statistics guaranteed to not be associated with an attack) for learning a null model, against which to assess the unlikeliness (p-value) of NC's most extreme statistic. By contrast, since the present invention considers all class pairs, our method produces O (K²) such null realizations. If K is not too small, a reliable null distribution can be estimated to evaluate an order statistic p-value for the class pair with the smallest perturbation with respect to this null. Also, NC infers only the target class, while the present invention infers both a source and target class when an attack is detected. Unlike NC, the present invention is not limited by the number of backdoor-attack source classes. Also, unlike [Guo et al., 2019], the present invention makes no assumptions about the shape or location of the backdoor pattern.

DETAILED DESCRIPTION OF DRAWINGS

FIG. 1 illustrates an exemplary embodiment of the present invention. A machine-learned decision-maker, here a neural network classifier (101), possibly contains a backdoor mapping achieved by a data-poisoning attack on its training dataset. This embodiment leverages clean (not backdoor attacked) training samples from different classes (100); these samples may or may not be accompanied by ground-truth labels. If a backdoor pattern is incorporated into a sample from a source class (or source classes), i.e., the source sample is perturbed by the backdoor pattern, the classifier's decision (output) is changed to the attacker's intended target class. For purposes of backdoor detection, for each pair of potential source s and target t≠s classes, a suitable objective function (e.g., optimization objective 102), an approximation or surrogate for the number of clean source samples from class s misclassified to t, is optimized over potential backdoor patterns (perturbations) Δ (103), with the optimization performed until the fraction of samples from s misclassified to t is large (greater than a specified threshold). An inference procedure for backdoor detection is then invoked (104), in one embodiment considering the perturbation sizes (according to some metric, for example a p-norm) for all backdoor (source,target) class-pair hypotheses. A detection is made if any of them is excessively small compared to all the others (104) or if there is a subset of excessively small perturbations that all involve the same target class. Thereby, the present invention determines whether the classifier has a backdoor or not; if a detection is made, (source, target) backdoor class pairs are identified and the backdoor pattern itself is estimated.

In FIG. 2, the attacker covertly adds one or more backdoor-poisoned samples (201) to the clean (not backdoor poisoned) training set (200) prior to classifier training (202), where all such samples have class labels for purposes of classifier training. The result is a backdoor-poisoned classifier (203). In this exemplary embodiment, photos from a camera are fed into the classifier to determine whether the car is authorized to proceed. After poisoning, unauthorized cars with a white pixel (the imperceptible backdoor pattern) on their rear bumper will in fact be authorized. Note that the pixelated car image illustrated in FIG. 2 is from a commonly used dataset of images that have been reduced in complexity to facilitate DNN testing, and was selected here primarily to clearly illustrate a single-pixel backdoor pattern. The disclosed techniques scale to large, high-resolution images and substantially more complex backdoor-poisoning attempts.

FIG. 3 illustrates an exemplary overview of backdoor attacks and defenses. A first set of source-class training samples (white) are associated with a first target class, and a second, distinct set of source-class training samples (black) are associated with a second, distinct target class. An attacker 300 incorporates an imperceptible backdoor pattern into copies of the white training samples to create an additional set of (poisoned) training samples (grey), labeled to the second (target) class, that will then be learned to be classified by the trained classifier 301 into the second (attacker's target) class; otherwise, the accuracy of the trained classifier 301 is not significantly impacted (304). The attacker may be an insider, or may plant poisoned samples when training-set augmentation is needed or if the training itself is outsourced, or may plant poisoned samples during test time if the classifier is dynamically retrained (adapted, reinforced). Defenses can be based on access to the training samples themselves (pre-training defenses—302) or just to the trained classifier (post-training defenses—303). In the latter case, when the training set itself is not available, clean (not backdoor poisoned) labeled samples from different classes can be used for purpose of devising a backdoor detector (303). Another type of defense is based on observations of test-samples (i.e., “in flight”), which is not depicted here. In-flight detection can identify entities exploiting the backdoor at test time.

FIG. 4 presents a flow chart that illustrates the process of detecting backdoor poisoning of a trained classifier. During operation, a trained classifier is received (operation 400); this trained classifier maps input data samples to one of a plurality of predefined classes based on a decision rule that leverages a set of parameters that are learned from a training dataset that may be backdoor-poisoned. Also received is a set of clean (unpoisoned) data samples that includes members from each of the plurality of predefined classes (operation 410). A backdoor detection system uses the trained classifier and the clean data samples to estimate for each possible source target class pair in the plurality of predefined classes potential backdoor perturbations that when incorporated into the clean data samples induce the trained classifier to misclassify the perturbed data samples from the respective source class to the respective target class (operation 420). The backdoor detection system compares the set of potential backdoor perturbations for the possible source target class pairs to determine a candidate backdoor perturbation based on perturbation sizes and misclassification rates (operation 430). The backdoor detection system then determines from the candidate backdoor perturbation whether the trained classifier has been backdoor poisoned (operation 440).

FIG. 7 illustrates a test-time evasion attack by an adversary. The adversary has modified a red “Stop” sign only by adding small yellow dots to three regions (operation 700), so that the classifier now decides (operation 701) that the sign is a yellow “Slow”. The image alteration by the adversary can be physical (e.g., painting three dots on the “Stop” sign) or digital (e.g., by intercepting the image before it reaches the classifier). For test-time evasion attacks, the typical (“white box”) assumption is that the adversary knows the classifier. In particular, the adversary knows that this classifier relies only on the color of these three regions of the sign to classify it to yellow “Slow”. Considering this, the classifier is not robust, and is used here just to simplify illustration. More subtle test-time evasion attacks on more robust classifiers/decision-makers have been demonstrated.

FIG. 8 presents a flow chart that illustrates the process of detecting a test-time evasion attack in accordance with an embodiment. During operation, a trained classifier is received (operation 800); this trained classifier maps input data samples to one of a plurality of predefined classes based on a decision rule that leverages a set of parameters that are learned from a training dataset. Also received is a set of clean (unpoisoned) data samples that includes members from the plurality of predefined classes (operation 810). A test-time evasion detection system analyzes the set of clean samples (operation 820) by estimating (for multiple clean data samples in the set) for a respective clean data sample a minimal-sized perturbation that is needed to change the trained classifier's class decision for the respective clean data sample from a classifier-determined class to another class in the plurality other than the classifier-determined class. The system tracks the esimated minimal-sized perturbation magnitudes determined during this analysis for class pairs in the plurality (operation 830). When the system receives a test sample to be classified, the trained classifier is used to determine the specific class that the test sample is associated with (operation 840). The system then estimates for the test sample a set of minimal-sized perturbations that are needed to change the trained classifier's class determination from that specific class to other classes in the plurality (e.g., classes other than the specific class) (operation 850). The system then compares the magnitudes of the minimal-sized perturbations that were estimated for the test sample with the tracked estimated minimal-sized perturbation magnitudes (from the clean data samples) to determine whether the test sample comprises a test-time evasion attack (operation 860).

DETAILED DESCRIPTION OF THE INVENTION

Embodiments of the present invention are based on the observation that a backdoor attack is similar to a “test-time evasion” attack, except that instead of seeking a minimal-size perturbation to alter the decision by the classifier from class s to class t for a single input pattern, the attacker seeks to alter the decision for every image (or most) from class s (and this by modifying the classifier itself through training data poisoning).

Thus, an anomaly detection defense framework is devised by mimicking the attacker, seeking whether a perturbation image can be found that is very modest in size/strength and yet which, when added to all images from s, induces the classifier to change the decision to t for most of them (finding such a perturbation effectively amounts to model inversion). If so, a backdoor in the classifier is detected involving the pair (s, t); else the backdoor hypothesis is rejected and the classifier is certified backdoor-free.

Let Z_(s) be the set of all images in Z from class s. If Z is unlabeled, then instead define Z_(s) as the images in Z classified by the classifier to s. Assuming the classifier's error rate for class s is low, this set will be a good surrogate for the images truly from class s.

An examplary embodiment of an objective function (criterion) to maximize, in seeking an image perturbation to induce decision changes from s to t, is as follows:

${{J_{st}\left( {Z_{s} + \Delta_{st}} \right)} = {{\sum\limits_{z \in Z_{s}}{P_{DNN}\left\lbrack {C = \left. t \middle| {z + \Delta_{st}} \right.} \right\rbrack}} - {P_{DNN}\left\lbrack {C = \left. s \middle| {z + \Delta_{st}} \right.} \right\rbrack}}},$

where P_(DNN) (C=s|z) is the decision-maker's (a deep neural network—DNN—in one embodiment) a posteriori probability for class s when sample z is input. That is, the class decision of the classifier for input sample z is the class which maximizes P_(DNN) (C=k|z), over all pre-defined classes k. So, if incorporating the perturbation Δ_(st) into sample z from (source class) s causes the class decision to change to t, then the summand P_(DNN)[C=t|z+Δ_(st)]−P_(DNN)[C=z|z+Δ_(st)] is positive; else it is negative. So, J_(st) (Z_(s)+Δ_(st)) is an embodiment of the tendency of the classifier to classify clean samples from source class s, Z_(s), to target class t when the perturbation Δ_(st) is incorporated into them. Another such embodiment for J_(st) could simply be the sum of the posterior probability of class t, over all samples in Z_(ƒ). When Δ_(st) is found that maximizes J_(st) (Z_(s)+Δ_(st)), the implication is that perturbation by Δ_(st) will typically cause misclassification to the target class for typical source class samples. When a perturbation Δ_(st) achieving high misclassifications to t is abnormally small compared to that corresponding to all other source and target class pairs (here naturally class confusion between them may also be considered to reckon abnormality), one can conclude that it is a backdoor pattern.

Now suppose a small-sized Δ_(st), in one embodiment ∥Δ_(st)∥<τ for p-norm ∥·∥ (the Euclidean or 2-norm is a special case), where τ is a chosen threshold on perturbation size. Note that this does not lead to restrictions on the location or support of the possible backdoor pattern Δ_(st) within the sample, or how the backdoor is incorporated.

If the fraction of samples Z_(s)+Δ_(st) assigned by the classifier to t, y_(st), γ_(st), is large (in one embodiment, larger than a chosen threshold on the misclassification fraction, Γ) AND ∥Δ_(st)∥<τ, the disclosed techniques may involve inferring that the classifier contains a backdoor from s to t. That is, it is expected that a backdoor is present misclassifying samples from class s to class t if there is an unusually small perturbation that induces most samples in Z_(s) to be classified to class t by the classifier.

Two embodiments of methods for maximizing J_(st) (·) with respect to Δ_(st) are now given for the image domain:

-   -   1. Gradient ascent in J_(st) (·) with respect to Δ_(st) until         either γ_(st)>Γ or ∥Δ_(st)∥>τ. Under the latter condition the         class pair (s, t) will be rejected as a backdoor class pair.         Note that since the support of Δ_(st) (i.e., the number or area         of pixels affected by it) is the entire image support, this is         considered to be an “image-wide” optimization procedure.

2. Pixel-wise hill-climbing ascent:

-   -   (i) Evaluate the partial derivative of J_(st) (·) with respect         to the perturbation of each pixel and each color plane of each         pixel (assuming color images);     -   (ii) Identify the (pixel, color plane) pair with largest partial         derivative. Perform a line search for the perturbation of this         chosen pixel which maximizes J_(st) (·) and update the chosen         pixel, for the chosen color plane, with this scalar         perturbation;     -   (iii) If γ_(st)<Γ AND ∥Δ_(st)∥>τ go to (i).

Once the (γ_(st), ∥Δ_(st)∥) statistics have been obtained for all K(K−1) class pairs, with K the number of pre-defined classes for the domain, pairs (s, t) can be identified with both high γ_(st) and unusually low ∥Δ_(st)∥ as possessing backdoors (with these statistics again possibly compared against the thresholds Γ and τ, respectively). If there are no such pairs, the classifier is declared backdoor-free.

The incorporation of a possible backdoor pattern Δ to a sample z, creating a perturbed sample z′=z+Δ, may first be modified to {tilde over (z)}≠z′ in the event that z′ is not a valid sample of the data domain under consideration. This is obviously necessary so that the resulting pattern is feasible. For example, an image domain may have a limited dynamic range of pixel intensities and so the pixel intensities of z′ may need to be thresholded to create {tilde over (z)} (whose pixel intensities are all in the limited range). As another example, if the classifier considers Internet packet flows, an Internet packet is typically less than 1540 bytes.

At test-time, a potentially backdoor-poisoned classifier may act to classify an unlabeled test-sample which has a backdoor incorporated. That is, the test-sample is created from a clean (not attacked) sample from a source class but has the backdoor pattern incorporated so that the classifier's decision will be to the target class associated with the backdoor. Determining whether a test-sample is exploiting the learned backdoor mapping is sometimes called in-flight detection. Considering that embodiments of the present invention can determine whether a classifier is backdoor poisoned and, if so, the associated backdoor perturbation and target and source classes, this information can be used as a basis for detecting use of the backdoor in flight. Similarly, if the training dataset is available and the classifier is deemed poisoned, then the disclosed techniques can be used to detect which of the training samples have incorporated a backdoor. For example, this can be done by removing the estimated backdoor perturbation from each training sample classified to the target class to see if a change in the class decision results.

Different methods of incorporating backdoors into data samples exist and are generally domain-dependent; however, domain-independent backdoor detection can be achieved by applying the perturbations of the disclosed techniques directly to the activations of internal layers of the neural network. The internal layers of the classifier form a more generic, domain-independent representation of the input sample. For example, the present invention can be applied to the neurons of the first convolutional layer of a Convolutional Neural Network (CNN) or to the neurons of the following max-pooling layer if a maxpooling layer is used. More specifically, in some embodiments, the neurons of an internal layer apply an activation function, such as sigmoid shaped hyperbolic tan (tanh) or a Rectified Linear Unit (ReLU), to the sum of weighted activations of the previous layer (which is closer to the input). The output of the activation functions of the neurons of one layer are fed to the next layer of the neural network. (The weights and activation-function parameters are learned through the training process of the neural network.) A different additional signal can be added to the input summer of each neuron of the internal layer, where a potential backdoor perturbation in some embodiments comprises the vector of such additional signals across all the neurons of the internal layer. In other embodiments, the potential backdoor perturbation is added directly to neural outputs (activations). In this way, such techniques facilitate applying embodiments of the present invention to different domains, including (but not limited to) audio (including speech), text, network packet traces, and/or images, irrespective of the manner in which a possible backdoor has been incorporated into the data samples. Finally, such an internal layer (especially a pooling layer) is typically of much lower dimension than the input layer, thus improving the scalability of the disclosed techniques. (Recall that using gradient-based search on a differentiable optimization objective, to determine potential backdoor perturbations, also improves scalability.)

One skilled in the art will know that different techniques of optimization can be used to estimate (group) perturbations. Also, different objective functions consistent with group misclassification can be used.

In some embodiments, different techniques of detection inference are possible. For example, a backdoor attack may cause more source classes (not specifically chosen by the attacker) than those of the data-poisoned training samples to be classified to the associated target class when the backdoor pattern is present (a kind of collateral damage of the data poisoning). In this case, one can consider the target classes associated with the smallest K perturbations identified by the foregoing optimization procedure embodiment (K being the number of predefined classes) and deem the classifier backdoor-attacked if an unusually large number of them are associated with a single target class. Note that, in the absence of a backdoor attack, one expects the target-class distribution across these K smallest perturbations to be approximately uniform.

More generally, for each potential target class t, the joint likelihood L_(t) of its K−1 associated perturbation sizes (one for every other class s≠t) can be assessed according to a null distribution built from the K(K−1)−(K−1)=(K−1)² other determined perturbation sizes (all found by the present invention). If L_(t) is much smaller than L_(τ) for all classes τ≠t, then the classifier is deemed to have a backdoor associated with target class t.

In some embodiments, different methods can be used to determine the decision-making hyperparameters (thresholds Γ, τ) to meet false-positive (and potentially false-negative) probability tolerances. For example, if available, a labeled set of classifiers can be used for this purpose, though, again, the disclosed techniques are unsupervised and can effectively detect an imperceptible backdoor in a classifier without such labeled examples. In particular, if a set of classifiers learned only using clean (not poisoned) training datasets is available, selection of hyperparameters can be based on the measured false-positive rate of this set. Such additional information would be unnecessary when the embodiment is based on detection inference using p-values, where the tolerable false positive rate directly corresponds to a p-value threshold. (Note that tolerance of false positives depends on the deployment scenario of the classifier; some scenarios, e.g., military related or financial institutions, are more tolerant of false positives and less tolerant of false negatives than some at-home deployments where lower false positives are preferred since they impede usability.) Alternatively, for each potential attack target class t , the smallest potential backdoor perturbation of a source class s≠t can be identified and compared (in size) with the remaining backdoor perturbations associated with other potential target classes to obtain a p-value. If such a p-value of a target class t is smaller by some margin (threshold) than those of all other target classes, then the classifier is deemed backdoor attacked, i.e., the p-value is anomalous and indicates backdoor poisoning; otherwise the classifier is deemed not backdoor attacked. Note that in some embodiments, there may not exist a potential backdoor perturbation that is both least size and induces the most misclassifications for a particular source and target class pair; in this case, one can consider, for example, the smallest potential backdoor perturbations which achieve a certain minimum number of misclassifications, or the potential backdoor perturbations with the most misclassifications which are smaller than a certain size. So, the disclosed techniques facilitate solving an open unsupervised imperceptible-backdoor detection problem, and also solves the simpler supervised problem wherein backdoor-labeled classifiers are given.

More specifically, in some embodiments, the null hypothesis of detection inference is that the classifier has not been attacked. Alternatively, if the classifier has been attacked, the statistics corresponding to class pairs involved in the attack should be large anomalies, with small p-values under the null distribution. We take the reciprocal of the size (e.g., 2-norm) of each estimated putative backdoor perturbation, over all class pairs (s, t), and then work with these reciprocals as decision statistics. Taking the reciprocal means that atypicalities will be extremely large values, not extremely small ones (close to zero). The reciprocals are thus well-suited to unimodal null models that peak near the origin (e.g., a Gamma distribution). Since the class pairs involved in a backdoor attack are assumed to share the same target class, we first conduct K tests, one for each putative target class. In each test, an estimation of the null density is learned by maximum likelihood estimation using the K(K−1)−(K−1)=(K−1)² reciprocal statistics, excluding the (K−1) reciprocals with the current target class under consideration. We then evaluate the probability that the largest of these (K−1) reciprocals under the null density is greater than or equal to their observed maximum. Under the null hypothesis, the order-statistic p-value thus obtained should be uniformly distributed on the interval [0,1]. Alternatively, if the classifier has been attacked with associated target class t, the order-statistic p-value corresponding to the target class t should be abnormally small. Hence we evaluate the probability (under the uniform distribution) that the smallest of the K order statistic p-values is smaller than or equal to the observed minimum.

Other detection-inference embodiments can be used to address different scenarios. For example, detection can account for inherent class confusion (if this information is available or can be accurately inferred by a labeled validation set). That is, a pair of classes with high natural class confusion may require much smaller perturbations to induce high misclassifications than a pair with low class confusion. Perturbation sizes could be adjusted to account for this prior to assessing their statistical significance. Also, when dealing with plural backdoors planted each involving a different target class, anomalous p-values will be associated with more than one target class.

Some data domains involve a mixture of some numerical and some discrete or categorical features. In some embodiments, categorical features are represented as numerical features. In other embodiments, decisions are conditioned on categorical features, or some combination of numerical representation and conditioning is used. If categorical features are not numerically represented, optimization to determine potential backdoor perturbations could involve a search that is a mixture of both continuous (gradient based) and discrete search techniques.

Also, some embodiments may optionally preprocess training data—e.g., a bag-of-words model for document (textual) samples or frequency-domain (cepstral) representations of speech samples—prior to the application of a neural network classifier.

Aspects of detecting a backdoor attack can be substantially similar to detecting a test-time evasion (TTE) attack. In some embodiments, TTE attacks on classifiers or decision-makers, particularly deep neural networks (DNNs), pose a significant risk, even for a classifier whose training dataset was not poisoned. Given knowledge of the classifier itself, an adversary may subtly (even imperceptibly) perturb their input to the classifier at test time in order to cause the class decision to change from a source class to a target class. For example, an image of a person who is unauthorized to access a resource can be modified slightly so that the classifier decides the image is that of an authorized person. A TTE attack detector for a K-class problem can be based on computing minimal perturbations for each sample, in a set of clean samples drawn from all known classes. For multiple such samples, K−1 perturbations are computed, modifying the respective sample so that its decided-upon (call it the target) class is altered to each of the K−1 other (source) classes. (Thus, the described techniques are substantially similar to embodiments described above that are used to detect potential backdoors in DNNs.) A null distribution of the perturbation magnitudes can then be computed for each of the K(K−1) (source, target) class pairs.

In some embodiments, the clean samples comprise all, or a portion of, the training dataset itself. Note that in some embodiments, the clean samples do not have representatives from some known classes, in which case null distributions cannot be computed for some (source, target) class pairs. In some embodiments, all of these clean samples are correctly classified.

Each test sample (sometimes also referred to interchangably as a “test-time sample”) that is input to the classifier is similarly minimally perturbed by the detector from the decided-upon (target) class that was determined for the test sample by the trained classifier to every other class (K−1 potential source classes). The p-value of each test sample perturbation is computed using the (previously-computed) null distribution for the same associated source and target class pair. It can then be determined whether the test sample is a TTE attack by comparing these K−1 p-values. Note that in some embodiments, this determination is based on comparing the p-values to a threshold.

More specifically, assume an TTE-attack detector possesses a set Z of clean input samples drawn from all K classes. Let c be the ground-truth class of input sample x and ƒ(x) be the classifier's decision. For each sample x ∈Z, the detector minimally perturbs x by ϵ(x, ƒ(x), s) so that the class decision changes to s≠ƒ(x). That is, for an additive perturbation,

ƒ(x)≠s=ƒ(x+ϵ(x, ƒ(x), s)).

For each class pair (s, t) such that s t, perturbation magnitudes {|ϵ(x, ƒ(x), s)|:ƒ(x)=t, ƒ(x+ϵ(x, ƒ(x), s))=s, x ∈z} are used to train a null distribution v_(s,t), e.g., a right-tailed Gamma distribution. Now for a test-sample y, the detector computes the required minimal perturbations δ(x, ƒ(y), s) to change its decided-upon class ƒ(y) to each class s≠ƒ(y). For each s≠ƒ(y), the p-value of δ(y, ƒ(y), s) is assessed according to the null V_(s,ƒ(y)). Note that in null hypothesis significance testing, a p-value is the probability of obtaining test results that are at least as extreme as the results that were actually observed (under the assumption that the null hypothesis is correct). A very small p-value means that such an extreme observed outcome would be very unlikely under the null hypothesis. Hence, a p-value is a measurement of how much an outlier a perturbation is; a small p-value thus indicates a substantial outlier that is likely part of an attack. In one embodiment, if any p-value is smaller than a threshold, the test sample y is deemed a TTE attack, where the threshold is based on a maximum false positive rate, i.e., the threshold is set in an unsupervised fashion. If all of the p-values are larger than the threshold, then the test sample is deemed to be valid (i.e., not a TTE attack). In some embodiments, thresholds may be specific to the class pairs, because natural classification confusion between class pairs may vary (e.g., different class pairs may have very different thresholds, for instance due to some class pairs being substantially different from each other).

The null distributions (sometimes also referred to as “nulls”) may be computed offline. In some embodiments, the nulls may be updated at runtime using test samples that are deemed not to be TTE attacks. For each test sample, the computation of the K−1 p-values can be done in parallel. In some embodiments, only a subset of the K−1 p-values per test sample are computed and used for detection.

FIG. 9 presents an examplary scenario in which a trained classifier 900 is used to determine whether a test sample comprises a test-time evasion attack. Trained classifier 900 is initially trained using a training set 905 (operation 1); after this initial training, trained classifier 900 can receive and classify input samples into target classes based on the decision rules determined during training. At some point after the classifier 900 has been trained, a perturbation mechanism 920 takes multiple clean data samples 910 (operation 2) and estimates minimal-sized perturbations to these clean data samples that would be needed to change the trained classifier's class decisions for each respective sample from an initial classifier-determined class to another class. More specifically, perturbation mechanism 920 uses knowledge of the parameters of the trained classifier 900 to determine perturbations that change the class decisions, and determines the smallest (minimal-sized) perturbations that can achieve such classification changes to the other predefined classes (operation 3). The magnitudes of such minimal-sized perturbations are used to train null distributions 930 (operation 4).

At some subsequent time, an input mechanism 940 presents a test sample 950 to a TTE attack detection mechanism 960 (operation 5). TTE attack detection mechanism 960 submits test sample 950 to the trained classifier 900 to receive an initial class determination (operation 6). TTE attack detection mechanism 960 then uses perturbation mechanism 920 (operation 7) to estimate a set of minimal perturbations for the test sample to determine the size of perturbation that would be needed to perturb the classification of the test sample from the initial class determination to each of the other predefined classes. More specifically, perturbation mechanism 920 formulates an objective based on the internal parameters of the trained classifier and the samples that are being perturbed (e.g., either a clean data sample or the test sample that are being perturbed), and a perturbation is determined by optimizing the objective as a function of the perturbation (as described in more detail in the preceeding techniques for backdoor detection) and confirming the target class changes using the trained classifier 900 (operation 8). Perturbation mechanism 920 then uses null distributions 930 (operation 9 a) to compute and store p-values 970 that quantify these test-sample perturbations' probability under the null distributions 930 (operation 9 b). TTE attack detection mechanism then accesses and analyzes the test-sample's p-values 970 (operation 10) to determine whether test sample 950 comprises a TTE attack, and outputs its determination (operation 11). More specifically, if the p-values are all larger than an associated threshold (e.g., a class-pair specific threshold), the test sample is not considered a TTE attack. If, however, any of the p-values is smaller than an associated threshold, this indicates that the test sample is very likely to be a TTE attack.

It will be appreciated that still further embodiments of the present invention will be apparent to those skilled in the art in view of the present disclosure. It is to be understood that the present invention is by no means limited to the particular constructions herein disclosed, but also comprises any modifications or equivalents within the scope of the invention.

Computing Environment

In summary, embodiments of the present invention facilitate detecting backdoor-poisoning attacks and test-time evasion attacks. In some embodiments of the present invention, techniques for detecting such attacks can be incorporated into a wide range of computing devices in a computing environment. For example, FIG. 5 illustrates a computing environment 500 in accordance with an embodiment of the present invention. Computing environment 500 includes a number of computer systems, which can generally include any type of computer system based on a microprocessor, a mainframe computer, a digital signal processor, a portable computing device, a personal organizer, a device controller, or a computational engine within an appliance. More specifically, referring to FIG. 5, computing environment 500 includes clients 510-512, users 520 and 521, servers 530-550, network 560, database 570, devices 580, appliance 590, and cloud based storage system 595.

Clients 510-512 can include any node on a network that includes computational capability and includes a mechanism for communicating across the network. Additionally, clients 510-512 may comprise a tier in an n-tier application architecture, wherein clients 510-512 perform as servers (servicing requests from lower tiers or users), and wherein clients 510-512 perform as clients (forwarding the requests to a higher tier).

Similarly, servers 530-550 can generally include any node on a network including a mechanism for servicing requests from a client for computational and/or data storage resources. Servers 530-550 can participate in an advanced computing cluster, or can act as stand-alone servers. For instance, computing environment 500 can include a large number of compute nodes that are organized into a computing cluster and/or server farm. In one embodiment of the present invention, server 540 is an online “hot spare” of server 550.

Users 520 and 521 can include: an individual; a group of individuals; an organization; a group of organizations; a computing system; a group of computing systems; or any other entity that can interact with computing environment 500.

Network 560 can include any type of wired or wireless communication channel capable of coupling together computing nodes. This includes, but is not limited to, a local area network, a wide area network, or a combination of networks. In one embodiment of the present invention, network 560 includes the Internet. In some embodiments of the present invention, network 560 includes phone and cellular phone networks.

Database 570 can include any type of system for storing data related to backdoor and/or test-time evasion attacks in non-volatile storage. This includes, but is not limited to, systems based upon magnetic, optical, or magneto-optical storage devices, as well as storage devices based on flash memory and/or battery-backed up memory. Note that database 570 can be coupled: to a server (such as server 550), to a client, or directly to a network. Alternatively, other entities in computing environment 500 (e.g., servers 530-550) may also store such data.

Devices 580 can include any type of electronic device that can be coupled to a client, such as client 512. This includes, but is not limited to, cell phones, personal digital assistants (PDAs), smartphones, personal music players (such as MP3 players), gaming systems, digital cameras, portable storage media, or any other device that can be coupled to the client. Note that, in some embodiments of the present invention, devices 580 can be coupled directly to network 560 and can function in the same manner as clients 510-512.

Appliance 590 can include any type of appliance that can be coupled to network 560. This includes, but is not limited to, routers, switches, load balancers, network accelerators, and specialty processors. Appliance 590 may act as a gateway, a proxy, or a translator between server 540 and network 560.

Cloud based compute system 595 can include any type of networked computing devices (e.g., a federation of homogeneous or heterogeneous storage devices) that together provide computing and data storage capabilities to one or more servers and/or clients. Note that the present invention is highly parallelizable. Thus, the present invention can take advantage of platforms such as Spark and Kubernetes which facilitate parallel computation in the cloud.

Note that different embodiments of the present invention may use different system configurations, and are not limited to the system configuration illustrated in computing environment 500. In general, any device that includes computational and storage capabilities may incorporate elements of the present invention.

In some embodiments of the present invention, some or all aspects 102,103, and/or 104 of the backdoor detection mechanism of FIGS. 1 and 9 can be implemented as dedicated hardware modules (indeed, the neural network classifier itself (101) may also have a customized hardware implementation.) A hardware system embodiment of the present invention might be motivated by the need to inspect a large number of possibly backdoor-attacked DNN classifiers, each with a large decision space (number of classes). Similarly, a hardware system embodiment might also be motivated by the need to perturb a large number of samples for a large number of classes to determine the presence of a test-time evasion attack. Such hardware modules (particularly detection module 103, inference module 104, perturbation mechanism 920, and TTE attack detection mechanism 960) can include, but are not limited to, processor chips, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), memory chips, and other programmable-logic devices now known or later developed.

FIG. 6 illustrates a computing device 600 that includes a processor 602 and a storage mechanism 604. Computing device 600 also includes a memory 606, a perturbation mechanism 608, and a test-time attack detection mechanism 610.

In some embodiments, computing device 600 uses processor 602, memory 606, perturbation mechanism 608, test-time attack detection mechanism 610, and storage mechanism 604 to perform functions that facilitate detecting TTE attacks. For instance, computing device 600 can execute TTE attack detection scans on processor 602 that access a trained classifier and data samples that are stored in one or more of memory 606, storage mechanism 604 and TTE attack detection mechanism 610 to determine whether a TTE attack has occured. Computing device 600 can also leverage perturbation mechanism 608 to perform a large number of parallel perturbations on data samples. Program instructions executing on processor 602 can create, compare and analyze such perturbations (as well as distributions and p-values based on such perturbations) to determine the presence of TTE attacks. Note that in many embodiments, processor 602 supports executing multiple different lightweight services in a single VM using docker containers.

In some embodiments of the present invention, some or all aspects of memory 606, perturbation mechanism 608, TTE attack detection mechanism 610, and/or storage mechanism 604 can be implemented as dedicated hardware modules in computing device 600. These hardware modules can include, but are not limited to, processor chips, application-specific integrated circuit (ASIC) chips, field-programmable gate arrays (FPGAs), memory chips, and other programmable-logic devices now known or later developed.

Processor 602 can include one or more specialized circuits for performing the operations of the mechanisms. Alternatively, some or all of the operations of memory 606, perturbation mechanism 608, TTE attack detection mechanism 610, and/or storage mechanism 604 may be performed using general purpose circuits in processor 602 that are configured using processor instructions. Thus, while FIG. 6 illustrates TTE attack detection mechanism 610, perturbation mechanism 608, memory 606, and/or storage mechanism 604 as being external to processor 602, in alternative embodiments some or all of these mechanisms can be internal to processor 602.

In these embodiments, when the external hardware modules are activated, the hardware modules perform the methods and processes included within the hardware modules. For example, in some embodiments of the present invention, the hardware module includes one or more dedicated circuits for performing the operations described above. As another example, in some embodiments of the present invention, the hardware module is a general-purpose computational circuit (e.g., a microprocessor or an ASIC), and when the hardware module is activated, the hardware module executes program code (e.g., BIOS, firmware, etc.) that configures the general-purpose circuits to perform the operations described above.

The foregoing descriptions of various embodiments have been presented only for purposes of illustration and description. They are not intended to be exhaustive or to limit the present invention to the forms disclosed. Accordingly, many modifications and variations will be apparent to practitioners skilled in the art. Additionally, the above disclosure is not intended to limit the present invention. The scope of the present invention is defined by the appended claims.

REFERENCES

-   [Patent WO 2014/137416A1] Sethumadhavan, L., Waksman, A., and     Suozzo, M. (2014) Identification of backdoors and backdoor triggers.     Patent WO 2014/137416 A1. -   [Biggio et al., 2013] Biggio, B., Corona, I., Majorca, D., Nelson,     B., Srndic, N., Laskov, P., Giacinto, G., and Roli, F. (2013)     Evasion attacks against machine learning at test time. In Proc.     ECMLPKDD. https://arxiv.org/abs/1708.06131 -   [Carlini and Wagner, 2017] Carlini, N. and Wagner, D. (2017)Towards     Evaluating the Robustness of Neural Networks. In Proc. IEEE     Symposium on Security and Privacy. https://arxiv.org/abs/1608.04644 -   [Chen et al., 2017] Chen, X., Liu, C., Li, B., Lu, K., and Song, D.     (2017)Targeted backdoor attacks on deep learning systems using data     poisoning.https://arxiv.org/abs/1712.05526v1 -   [Chen et al., 2018] Chen, B., Carvalho, W., Baracaldo, N., Ludwig,     H., Edwards, B., Lee, T., Malloy, I., and Srivastava, B. (2018)     Detecting backdoor attacks on deep neural networks by activation     clustering. https://arxiv.org/abs/1811.03728 -   [Gao et al., ] Gao, Y., Xu, C., Wang, D., Chen, S., Ranasinghe, D.,     and Nepal, S. STRIP: A Defence Against Trojan Attacks on Deep Neural     Networks.https://arxiv.org/abs/1902.06531 -   [Goodfellow et al., 2015] Goodfellow, I., Shlens, J., and     Szegedy, C. (2015) Explaining and harnessing adversarial examples.     In Proc. ICLR. https://arxiv.org/abs/1412.6572 -   [Guo et al., 2019] Guo, W., Wang, L., Xing, X., Du, M., and Song, D.     (2019)TABOR: A Highly Accurate Approach to Inspecting and Restoring     Trojan Backdoors in AI Systems.https://arxiv.org/abs/1908.01763 -   [Hampel, 1974] Hampel, F. R. (1974) The influence curve and its role     in robust estimation. Journal of the American Statistical     Association 69. -   [Huang et al., 2011] Huang, L., Joseph, A., Nelson, B., Rubinstein,     B., and Tygar, J. (2011)Adversarial machine learning. In Proc. 4th     ACM Workshop on Artificial Intelligence and Security (AISec). http:     //citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.360.168&rep=rep1&type=pdf -   [Liao et al., 2018] Liao, C., Zhong, H., Squicciarini, A., Zhu, S.,     and Miller, D. (Aug. 2018)Backdoor embedding in convolutional neural     network models via invisible perturbation.     https://arxiv.org/abs/1808.10307 -   [Liu et al., 2018] Liu, K., Doan-Gavitt, B., and Garg, S. (2018)     Fine-Pruning: Defending Against Backdoor Attacks on Deep Neural     Networks. In Proc. RAID. https://arxiv.org/abs/1805.12185 -   [Miller et al., 2014] Miller, B., Kantchelian, A., Afroz, S.,     Bachwani, R., Dauber, E., Huang, L., Tschantz, M. C., Joseph, A. D.,     and Tygar, J. D. (2014) Adversarial Active Learning. In Proc.     Workshop on Artificial Intelligence and Security (AISec),     Scottsdale, Ariz.     http://www.icsi.berkeley.edu/pubs/networking/adversarialactivelearning2014.pdf -   [Miller et al., 2018] Miller, D. J., and Wang, Y., and     Kesidis, G. (2018) Anomaly Detection of Attacks (ADA) on DNN     Classifiers at Test Time. Neural Computation.     https://arxiv.org/abs/1712.06646 -   [Papernot et al., 2016] Papernot, N., McDaniel, P., Jha, S.,     Fredrikson, M., Celik, Z., and Swami, A. (2016) The limitations of     deep learning in adversarial settings. In Proc. 1st IEEE European     Symp. on Security and Privacy. https://arxiv.org/abs/1511.07528 -   [Szegedy et al., 2014] Szegedy, C., Zaremba, W., Sutskever, I.,     Bruna, J., Erhan, D., Goodfellow, I., and Fergus, R. (2014)     Intriguing properties of neural networks. In Proc. ICLR.     https://arxiv.org/abs/1312.6199 -   [Tran et al., 2018] Tran, B., LI, J., and Madry, A. (2018) Spectral     signatures in backdoor attacks. In Proc. NIPS.     https://arxiv.org/abs/1811.00636 -   [Wang et al., 2019] Wang, B., Yao, Y., Shan, S., Li, H., Viswanath,     B., Zheng, H., and Zhao, B. (2019) Neural Cleanse: Identifying and     Mitigating Backdoor Attacks in Neural Networks In Proc. IEEE     Symposium on Security and Privacy.     http://people.cs.uchicago.edu/-huiyingli/publication/backdoor-sp19.pdf -   [1] IARPA TrojAI Trojans in Artificial Intelligence.     https://www.iarpa.gov/index.php/research-programs/trojai/trojai-baa,     2019. -   [Xiang et al., 2019b] Xiang, Z., Miller, D. J., and     Kesidis, G. (2019) A Benchmark Study of Backdoor Data Poisoning     Defenses for Deep Neural Network Classifiers and A Novel Defense.     Proc. IEEE MLSP, Pittsburgh. -   [Xiang et al., 2019a] Xiang, Z., Miller, D. J., and     Kesidis, G. (2019) Revealing Backdoors, Post-Training, in DNN     Classifiers via Novel Inference on Optimized Perturbations Inducing     Group Misclassification. https://arxiv.org/abs/1908.10498 -   [Xiao et al., 2015] Xiao, H., Biggio, B., Nelson, B., Xiao, H.,     Eckert, C., Roli, F. (2015) Support vector machines under     adversarial label contamination. Neurocomputing 160(C):53-62. http:     //citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.638.7484&rep=rep1&type=pdf 

What is claimed is:
 1. A computer-implemented method for detecting test-time evasion attacks on a trained classifier, comprising: receiving the trained classifier, wherein the trained classifier maps input data samples to one of a plurality of predefined classes based on a decision rule that leverages a set of parameters that are learned from a training dataset; receiving a set of clean (unpoisoned) data samples that includes members from the plurality of predefined classes; for multiple clean data samples in the set, estimating for a respective clean data sample a minimal-sized perturbation that is needed to change the trained classifier's class decision for the respective clean data sample from a classifier-determined class to another class in the plurality other than the classifier-determined class; tracking estimated minimal-sized perturbation magnitudes for class pairs in the plurality; receiving a test sample to be classified and using the trained classifier to determine that the test sample is associated with a specific class; estimating for the test sample a set of minimal-sized perturbations needed to change the trained classifier's class determination from the specific class to other classes in the plurality other than the specific class; and comparing the magnitudes of the set of minimal-sized perturbations for the test sample with the tracked estimated minimal-sized perturbation magnitudes to determine whether the test sample comprises an attack.
 2. The computer-implemented method of claim 1, wherein tracking the estimated minimal-sized perturbation magnitudes comprises using the estimated minimal-sized perturbation magnitudes to train one or more null distributions; and wherein comparing the magnitudes of the set of minimal-sized perturbations for the test sample involves computing p-values to quantify the test-sample perturbations' probability under the null distributions.
 3. The computer-implemented method of claim 2, wherein the method further comprises: comparing the p-values to a threshold; and if the p-values are all larger than the threshold, determining that the test sample is not a test-time evasion attack.
 4. The computer-implemented method of claim 3, wherein the threshold is specific to a class pair and provides an upper-bound on the number of test-time-evasion-attack false-positives when the classes for the set of clean data samples are known.
 5. The computer-implemented method of claim 2, wherein the method further comprises: comparing the p-values to a threshold; and if any one of the p-values is smaller than the threshold, determining that the test sample is a test-time evasion attack.
 6. The computer-implemented method of claim 5, wherein the threshold is specific to a class pair and provides an upper-bound on the number of test-time-evasion-attack false-positives when the classes for the set of clean data samples are known.
 7. The computer-implemented method of claim 1, wherein the set of clean data samples is a subset of the training dataset of the classifier.
 8. The computer-implemented method of claim 1, wherein the trained classifier is a neural network.
 9. The computer-implemented method of claim 1, wherein the set of clean data samples are unlabeled; and wherein class labels are obtained for the set of clean data samples by applying the decision rule of the trained classifier upon the set of clean data samples.
 10. The computer-implemented method of claim 1, wherein the data samples are images.
 11. The computer-implemented method of claim 10, wherein the data-sample images comprise at least one of human faces, human fingerprints and human irises; and wherein the trained classifier is part of an access-control system.
 12. The computer-implemented method of claim 1, wherein estimating a perturbation comprises using a gradient ascent technique to maximize a differentiable objective function, with respect to the perturbations, that is an approximation of the non-differentiable count of misclassified perturbed clean samples.
 13. The computer-implemented method of claim 2, wherein the clean data samples used to train the null distributions are drawn from all known classes in the plurality of predefined classes.
 14. The computer-implemented method of claim 2, wherein the clean data samples used to train the null distributions are all correctly classified.
 15. The computer-implemented method of claim 2, wherein the p-values for the test sample are computed in parallel.
 16. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for detecting test-time evasion attacks on a trained classifier, the method comprising: receiving the trained classifier, wherein the trained classifier maps input data samples to one of a plurality of predefined classes based on a decision rule that leverages a set of parameters that are learned from a training dataset; receiving a set of clean (unpoisoned) data samples that includes members from the plurality of predefined classes; for multiple clean data samples in the set, estimating for a respective clean data sample a minimal-sized perturbation that is needed to change the trained classifier's class decision for the respective clean data sample from a classifier-determined class to another class in the plurality other than the classifier-determined class; tracking estimated minimal-sized perturbation magnitudes for class pairs in the plurality; receiving a test sample to be classified and using the trained classifier to determine that the test sample is associated with a specific class; estimating for the test sample a set of minimal-sized perturbations needed to change the trained classifier's class determination from the specific class to other classes in the plurality other than the specific class; and comparing the magnitudes of the set of minimal-sized perturbations for the test sample with the tracked estimated minimal-sized perturbation magnitudes to determine whether the test sample comprises an attack.
 17. A test-time-evasion attack-detection system that detects test-time evasion attacks a trained classifier, comprising: a processor; a memory; a perturbation mechanism; and a test-time-evasion (TTE) attack detection mechanism; wherein at least one of the processor, the perturbation mechanism and the TTE attack detection mechanism are configured to receive the trained classifier and store parameters for the trained classifier and program instructions that operate upon the trained classifier in the memory; wherein the trained classifier maps input data samples to one of a plurality of predefined classes based on a decision rule that leverages a set of parameters that are learned from a training dataset; wherein the at least one of the perturbation mechanism and the test-time evasion attack detection system are configured to: receive a set of clean (unpoisoned) data samples that includes members from the plurality of predefined classes; for multiple clean data samples in the set, estimate for a respective clean data sample a minimal-sized perturbation that is needed to change the trained classifier's class decision for the respective clean data sample from a classifier-determined class to another class in the plurality other than the classifier-determined class; track estimated minimal-sized perturbation magnitudes for class pairs in the plurality; receive a test sample to be classified and using the trained classifier to determine that the test sample is associated with a specific class; estimate for the test sample a set of minimal-sized perturbations needed to change the trained classifier's class determination from the specific class to other classes in the plurality other than the specific class; and compare the magnitudes of the set of minimal-sized perturbations for the test sample with the tracked estimated minimal-sized perturbation magnitudes to determine whether the test sample comprises an attack. 